Decidability in Syntactic Control of Interference

Decidability and syntactic control of interference

We investigate the decidability of observational equivalence and approximation in Reynolds’ “Syntactic Control of Interference” (SCI), a prototypical functionalimperative language in which covert interference between functions and their arguments is prevented by the use of an affine typing discipline. By associating denotations of terms in a fully abstract “relational” model of finitary basic S...

Decidability and Tameness in the Theory of Finite Semigroups

Non-Interference Control Synthesis for Security Timed Automata

In this paper, the problem of synthesizing controllers that ensures non interference for multilevel security dense timed discrete event systems modeled by an extension of Timed Automata, is addressed for the first time. We first discuss a notion of non interference for dense real-time systems that refines notions existing in the literature and investigate decidability issues raised by the verif...

Non - Interference Control Synthesis for Security Timed Automata 1 Guillaume

In this paper, the problem of synthesizing controllers that ensures non interference for multilevel security dense timed discrete event systems modeled by an extension of Timed Automata, is addressed for the first time. We first discuss a notion of non interference for dense real-time systems that refines notions existing in the literature and investigate decidability issues raised by the verif...

A Formal Derivation of the Decidability of the Theory SA

Hosono, C. and Y. Ikeda, A formal derivation of the decidability of the theory SA, Theoretical Computer Science 127 (1994) l-23. A formal definition of a first-order theory SA, which is an extension of Presburger arithmetic to rational numbers, is introduced and syntactic proof of the decidability of SA is given. This proof has already been outlined by Smorynski, but this work is independent of...